Computation of antieigenvalues

نویسنده

  • Morteza Seddighin
چکیده

μ1(T) measures the maximum turning capability of T . A vector f for which the inf in (1.1) is attained is called an antieigenvector of T . Cosine of T has important applications in pure operator theory as well as numerical analysis (see [3, 4, 6]). In [7, 8, 11], we have computed the first antieigenvalue of normal accretive operators in terms of eigenvalues of these operators. In [12], we computed the first antieigenvalue for certain classes of matrices on the real field. In this note, we will focus on computation and approximation of the first antieigenvalue of general accretive operators. Our work in this note is a generalization of our work in [7, 8, 11] to certain classes of nonnormal operators. We will start with the case of a general two-by-two matrix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Key Frame-Based Activity Representation Using Antieigenvalues

Many activities may be characterized by a sequence of key frames that are related to important changes in motion rather than dominant characteristics that persist over a long sequence of frames. To detect such changes, we define a transformation operator at every time instant, which relates the past to the future states. One of the useful quantities associated with numerical range of an operato...

متن کامل

State Space Approaches for Modeling Activities in Video Streams

Title of dissertation: STATE SPACE APPROACHES FOR MODELING ACTIVITIES IN VIDEO STREAMS Naresh P. Cuntoor Doctor of Philosophy, 2006 Dissertation directed by: Professor Rama Chellappa Department of Electrical and Computer Engineering The objective is to discern events and behavior in activities using video sequences, which conform to common human experience. It has several applications such as r...

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Normalized Tenacity and Normalized Toughness of Graphs

In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters.  Using these new parameters enables the graphs with different orders be comparable with each other regarding their vulnerabilities. These parameters are reviewed and discussed for some special graphs as well.

متن کامل

Parallel computation framework for optimizing trailer routes in bulk transportation

We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2005  شماره 

صفحات  -

تاریخ انتشار 2005